The Möbius function of permutations with an indecomposable lower bound

نویسندگان

Robert Brignall

D. Marchant

چکیده

We show that the Möbius function of an interval in a permutation poset where the lower bound is sum (resp. skew) indecomposable depends solely on the sum (resp. skew) indecomposable permutations contained in the upper bound, and that this can simplify the calculation of the Möbius sum. For increasing oscillations, we give a recursion for the Möbius sum which only involves evaluating simple inequalities.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Möbius Function of Permutations with One Descent

The set of all permutations, ordered by pattern containment, is a poset. We give a formula for the Möbius function of intervals [1, π] in this poset, for any permutation π with at most one descent. We compute the Möbius function as a function of the number and positions of pairs of consecutive letters in π that are consecutive in value. As a result of this we show that the Möbius function is un...

متن کامل

Indecomposable permutations with a given number of cycles

A permutation a1a2 . . . an is indecomposable if there does not exist p < n such that a1a2 . . . ap is a permutation of {1, 2, . . . , p}. We compute the asymptotic probability that a permutation of Sn with m cycles is indecomposable as n goes to infinity with m/n fixed. The error term is O( log(n−m) n−m ). The asymptotic probability is monotone in m/n, and there is no threshold phenomenon: it ...

متن کامل

The Möbius Function of Separable and Decomposable

We give a recursive formula for the Möbius function of an interval [σ, π] in the poset of permutations ordered by pattern containment in the case where π is a decomposable permutation, that is, consists of two blocks where the first one contains all the letters 1, 2, . . . , k for some k. This leads to many special cases of more explicit formulas. It also gives rise to a computationally efficie...

متن کامل

A New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks

In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...

متن کامل